Orthogonal layout with optimal face complexity
نویسندگان
چکیده
منابع مشابه
Orthogonal Layout with Optimal Face Complexity
We study a problem motivated by rectilinear schematization of geographic maps. Given a biconnected plane graph G and an integer k ≥ 0, does G have a strictorthogonal drawing (i.e., an orthogonal drawing without edge bends) with at most k reflex angles per face? For k = 0, the problem is equivalent to realizing each face as a rectangle. We prove that the strict-orthogonal drawability problem for...
متن کاملOrthogonal Layout with Optimal Face Complexity: NP-hardness and Polynomial-time Algorithms
Given a biconnected plane graph G and a nonnegative integer k, we examine the problem of deciding whether G admits a strict-orthogonal drawing (i.e., an orthogonal drawing without bends) such that the reflex face complexity (the maximum number of reflex angles in any face) is at most k. We introduce a new technique to solve the problem in O(n min{k, log n log k}) time, while no such subquadrati...
متن کاملFace Recognition Using Optimal Non-Orthogonal Wavelet Basis Evaluated by Information Complexity
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of machine vision. In this paper, we represent face images as combinations of 2-D Gabor wavelet basis which are non-orthogonal. Genetic Algorithm (GA) is used to find an optimal basis derived from a combination of frequenci...
متن کاملInvestigating Layout Complexity
This paper presents work-in-progress in assessing the usefulness of a layout complexity metric in evaluating the usability of different screen designs. The metric is based on the Shannon formula from communication theory. Initially the metric was applied to thirteen Windows applications where thirty subjects were asked to rank screens on the basis of “good” design. A significant negative correl...
متن کاملStress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
We present a fundamentally different approach to orthogonal layout of data flow diagrams with ports. This is based on extending constrained stress majorization to cater for ports and flow layout. Because we are minimizing stress we are able to better display global structure, as measured by several criteria such as stress, edge-length variance, and aspect ratio. Compared to the layered approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.02.005